package com.example.leetcode.niuke;

import java.util.*;

public class NiuKe7 {


    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int count = scanner.nextInt();
        Set<Integer> set = new HashSet<>();
        PriorityQueue<Integer> queue = new PriorityQueue<>(Comparator.comparingInt(x -> x));
        int t = count;
        while (t >= 0) {
            int i = t * a + b * (count - t);
            if (!set.contains(i)) {
                queue.add(i);
                set.add(i);
            }
            t--;
        }
        System.out.print("[");
        while (!queue.isEmpty()) {
            System.out.print(queue.poll());
            if (!queue.isEmpty()) {
                System.out.print(",");
            }
        }
        System.out.print("]");
    }
}
